The paper gives a class 4-tight optimal double loop network infinite family 本文给出了一类4-紧优的双环网无限族。
The problem of finding optimal diameter double loop network with a fixed number of vertices has been widely studied by graph theory and computer science researchers 摘要找出给定顶点数的双环网的最小直径是图论和计算机工作者重点研究的问题之一。
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重点研究了l3的情形,即三环网络,给出其直径的上界,并给出n不太大时,三环网络取得最优的一个条件
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重点研究了l3的情形,即三环网络,给出其直径的上界,并给出n不太大时,三环网络取得最优的一个条件
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重点研究了l3的情形,即三环网络,给出其直径的上界,并给出n不太大时,三环网络取得最优的一个条件
5 the optimal design mathematics models and calculations of the single source looped network which source pressure is undecided and the single source looped network which source pressure is decided are presented respectively 5分别建立了水源水压已定单水源环状管网和水源水压未定单水源环状管网优化设计数学模型,并提出了计算方法。